Branch-and-Bound Algorithms for Constrained Paths and Path Pairs and Their Application to Transparent WDM Networks
نویسندگان
چکیده
We introduce three novel algorithms for routing in WDM networks. These schemes are based on the “Best-First Branch-and-Bound” algorithm and take constraints into account. An exact algorithm for the unprotected routing problem in WDM networks, one exact algorithm, and a heuristic for the routing with 1+1 protection are described. By simulations with realistic optical networks and grid topologies we can demonstrate that our algorithms exhibit short computation times.
منابع مشابه
Constrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملA Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملRouting, wavelength assignment, and spectrum allocation algorithms in transparent flexible optical WDM networks
Current fixed grid wavelength routed networks are limited in terms of spectral efficiency due to the rigid nature of wavelength assignment. We propose the Flexible Optical WDM (FWDM) network architecture for flexible grid optical networks in which the constraint on fixed spectrum allocation to channels is removed and network resources can be dynamically provisioned with an automated control pla...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006